Quantum Chaotic Butterfly Optimization Algorithm With Ranking Strategy for Constrained Optimization Problems
نویسندگان
چکیده
Nature-inspired metaheuristic optimization algorithms, e.g., the butterfly algorithm (BOA), have become increasingly popular. The BOA, which adapts food foraging and social behaviors of butterflies, involves randomly defined, algorithmic-dependent parameters that affect exploration exploitation strategies, negatively influences overall performance algorithm. To address this issue improve performance, paper proposes a modified i.e., quantum chaos BOA (QCBOA), relies on theory computing techniques. Chaos mapping unpredictable divergent behavior helps tune critical parameters, wave concept representative butterflies in explore search space more effectively. proposed QCBOA also implements ranking strategy to maintain balance between phases, is lacking conventional BOAs. evaluate reliability efficiency, tested against well-utilized set 20 benchmark functions travelling salesman problem belongs class combinatorial problems. Besides, method adopted photovoltaic system parameter extraction demonstrate its application real-word An extensive comparative study was conducted compare with BOAs, fine-tuned particle swarm (PSO) algorithm, differential evolution (DE), genetic (GA). results that, yield better for most cases rest cases. speed convergence increased compared expected provide other problems functions.
منابع مشابه
Multi-objective optimization based reverse strategy with differential evolution algorithm for constrained optimization problems
Solving constrained optimization problems (COPs) has been gathering attention from many researchers. In this paper, we defined the best fitness value among feasible solutions in current population as gbest. Then, we converted the original COPs to multi-objective optimization problems (MOPs) with one constraint. The constraint set the function value f(x) should be less than or equal to gbest; th...
متن کاملFOA: ‘Following’ Optimization Algorithm for solving Power engineering optimization problems
These days randomized-based population optimization algorithms are in wide use in different branches of science such as bioinformatics, chemical physics andpower engineering. An important group of these algorithms is inspired by physical processes or entities’ behavior. A new approach of applying optimization-based social relationships among the members of a community is investigated in this pa...
متن کاملBalanced ranking method for constrained optimization problems using evolutionary algorithms
. This work presents a new technique to handle constraints in the solution of optimization problems by evolutionary algorithms – the Balanced Ranking Method (BRM). In this method the fitness function is based on two rankings, for feasible and infeasible solutions respectively. The rankings are merged according to deterministic criteria that consider the status of the search process and specific...
متن کاملA New Hybrid Flower Pollination Algorithm for Solving Constrained Global Optimization Problems
Global optimization methods play an important role to solve many real-world problems. Flower pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, a new hybrid optimization method called hybrid flower pollination algorithm (FPPSO) is proposed. The method combines the standard flower pollination algorithm (FP) with the par...
متن کاملBQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems
Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2021
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2021.3104353